Stability and Minimax Optimality of Tangential Delaunay Complexes for Manifold Reconstruction
نویسندگان
چکیده
In this paper we consider the problem of optimality in manifold reconstruction. A random sample Xn = {X1, . . . , Xn} ⊂ R composed of points lying on a d-dimensional submanifold M , with or without outliers drawn in the ambient space, is observed. Based on the Tangential Delaunay Complex [4], we construct an estimator M̂ that is ambient isotopic and Hausdorffclose to M with high probability. The estimator M̂ is built from existing algorithms. In a model without outliers, we show that this estimator is asymptotically minimax optimal for the Hausdorff distance over a class of submanifolds defined with a reach constraint. Therefore, even with no a priori information on the tangent spaces of M , our estimator based on Tangential Delaunay Complexes is optimal. This shows that the optimal rate of convergence can be achieved through existing algorithms. A similar result is also derived in a model with outliers. A geometric interpolation result is derived, showing that the Tangential Delaunay Complex is stable with respect to noise and perturbations of the tangent spaces. In the process, a denoising procedure and a tangent space estimator both based on local principal component analysis (PCA) are studied.
منابع مشابه
Constructing Intrinsic Delaunay Triangulations of Submanifolds
We describe an algorithm to construct an intrinsic Delaunay triangulation of a smooth closed submanifold of Euclidean space. Using results established in a companion paper on the stability of Delaunay triangulations on δ-generic point sets, we establish sampling criteria which ensure that the intrinsic Delaunay complex coincides with the restricted Delaunay complex and also with the recently in...
متن کاملOn the Minimax Optimality of Block Thresholded Wavelets Estimators for ?-Mixing Process
We propose a wavelet based regression function estimator for the estimation of the regression function for a sequence of ?-missing random variables with a common one-dimensional probability density function. Some asymptotic properties of the proposed estimator based on block thresholding are investigated. It is found that the estimators achieve optimal minimax convergence rates over large class...
متن کاملInteractive Surface Reconstruction from DelaunayTriangulationCS
This paper presents a new combinatorial algorithm for surface reconstruction. It is an interactive and incremental algorithm based on a deenition of the strength of a Delaunay triangle. Local topology of a 2D manifold is enforced while Delaunay triangles are inserted into the partially reconstructed surface in the decreasing order of their strength.
متن کاملA Weak Characterisation of the Delaunay Triangulation
We consider a new construction, the weak Delaunay triangulation of a finite point set in a metric space, which contains as a subcomplex the traditional (strong) Delaunay triangulation. The two simplicial complexes turn out to be equal for point sets in Euclidean space, as well as in the (hemi)sphere, hyperbolic space, and certain other geometries. There are weighted and approximate versions of ...
متن کاملEfficient Moving Point Handling for Incremental 3D Manifold Reconstruction
As incremental Structure from Motion algorithms become effective, a good sparse point cloud representing the map of the scene becomes available frame-by-frame. From the 3D Delaunay triangulation of these points, state-of-the-art algorithms build a manifold rough model of the scene. These algorithms integrate incrementally new points to the 3D reconstruction only if their position estimate does ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017